Can Random Coin Flips Speed Up a Computer?
نویسنده
چکیده
Random sampling relies on the law of large numbers. To see this, suppose 57% of the population supports Obama. Asking a random person whether they support Obama is the same as flipping a biased coin, which comes up “yes” 57% of the time and “no” 43% of the time. By the law of large numbers, the more people we ask, the smaller the error. Note that this argument doesn’t depend on the size of the population; the error would be the same regardless of the population of the United States.
منابع مشابه
Tossing a Biased Coin
When we talk about a coin toss, we think of it as unbiased: with probability one-half it comes up heads, and with probability one-half it comes up tails. An ideal unbiased coin might not correctly model a real coin, which could be biased slightly one way or another. After all, real life is rarely fair. This possibility leads us to an interesting mathematical and computational question. Is there...
متن کاملSimulating a die roll by flipping two coins
We show how to simulate a roll of a fair n-sided die by one flip of a biased coin with probability 1/n of coming up heads, followed by 3⌊log 2 n⌋+ 1 flips of a fair coin. Let a p-coin be a biased coin with probability p of coming up heads. A fair coin is a (1/2)-coin. A fair n-sided die is a die with n sides, each of which comes up with probability 1/n when the die is rolled. Proposition 1. For...
متن کاملDynamical Bias in the Coin Toss
We analyze the natural process of flipping a coin which is caught in the hand. We prove that vigorously-flipped coins are biased to come up the same way they started. The amount of bias depends on a single parameter, the angle between the normal to the coin and the angular momentum vector. Measurements of this parameter based on high-speed photography are reported. For natural flips, the chance...
متن کاملEECS 70 Discrete Mathematics and Probability Theory Spring 2014 Anant Sahai Lecture 16 Variance
Question: Let us return once again to the question of how many heads in a typical sequence of n coin flips. Recall that we used the Galton board to visualize this as follows: consider a token falling through the Galton board, deflected randomly to the right or left at each step. We think of these random deflections as taking place according to whether a fair coin comes up heads or tails. The ex...
متن کاملOptimal linear Bernoulli factories for small mean problems
Suppose a coin with unknown probability p of heads can be flipped as often as desired. A Bernoulli factory for a function f is an algorithm that uses flips of the coin together with auxiliary randomness to flip a single coin with probability f(p) of heads. Applications include perfect sampling from the stationary distribution of certain regenerative processes. When f is analytic, the problem ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1007.1678 شماره
صفحات -
تاریخ انتشار 2009